/// @tags:
#include <cstdio>
#include <functional>
#include <iostream>
#include <numeric>

using std::cin, std::cout, std::endl;

namespace BlueQuantum {

constexpr int maxn = 1e2 + 2;

int cnt[maxn];
long long a[maxn];

int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
      cin >> a[i];
    }
    bool ans = true;
    std::sort(a + 1, a + n + 1);
    for (int i = 2; i <= n; ++i) {
      if (a[i] == a[i - 1]) ans = false;
    }
    for (int i = 2; i <= n / 2; ++i) {
      std::fill(cnt, cnt + i, 0);
      for (int j = 1; j <= n; ++j) {
        cnt[a[j] % i]++;
      }
      if (*std::min_element(cnt, cnt + i) >= 2) ans = false;
    }
    cout << (ans ? "YES\n" : "NO\n");
  }
  return 0;
}

}  // namespace BlueQuantum

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("C. Koxia and Number Theory.in", "r", stdin);
  freopen("C. Koxia and Number Theory.out", "w", stdout);
#endif
#endif

  std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  return BlueQuantum::main();
}
